On Simultaneous Block-Diagonalization of Cyclic Commuting Matrices

نویسندگان

  • Tom McKinley
  • Boris Shekhtman
چکیده

We study simultaneous block-diagonalization of cyclic d-tuples of commuting matrices. Some application to ideal projectors are also presented. In particular we extend Hans Stetter’s theorem characterizing Lagrange projectors. 1 Introduction Let V be a …nite-dimensional space over complex …eld C and let L := (L1; :::; Ld) be a d-tuple of pairwise commuting operators on V . Every polynomial p(x1; :::; xd) = X ck1;:::kdx k1 1 :::x kd d 2 C[x1; :::; xd] de…nes an operator p(L) := X ck1;:::kdL k1 1 :::L kd d (1.1) on V . A d-tuple L is called cyclic if there exists a vector v0 2 V such that fp(L)v0; p 2 C[x1; :::; xd]g = V . (1.2) A vector v0 satisfying (1.2) is called a cyclic vector for L. A vector v 2 V is called a common eigenvector for L if for all j = 1; :::; d there exist j 2 C such that Ljv = jv. The d-tuple = ( 1; :::; d) 2 C is called an eigentuple of L. The set of all eigentuples of L is denoted by (L). In case d = 1, an operator L is cyclic if and only if L is 1-regular, i.e., every eigenspace of L is at most one-dimensional. For d > 1 this is false in both directions as the following example (already used in [4] for di¤erent purposes) demonstrates:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Methods for Simultaneousdiagonalization

We present a Jacobi-like algorithm for simultaneous diagonalization of commuting pairs of complex normal matrices by unitary similarity transformations. The algorithm uses a sequence of similarity transformations by elementary complex rotations to drive the oo-diagonal entries to zero. We show that its asymptotic convergence rate is quadratic and that it is numerically stable. It preserves the ...

متن کامل

Almost-commuting matrices are almost jointly diagonalizable

We study the relation between approximate joint diagonalization of self-adjoint matrices and the norm of their commutator, and show that almost commuting self-adjoint matrices are almost jointly diagonalizable by a unitary matrix.

متن کامل

Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices

An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix ∗-algebra generated by the given matrices. It is simpler than other existing m...

متن کامل

A global convergence proof of cyclic Jacobi methods with block rotations LAPACK Working Note 196

This paper introduces a globally convergent block (column– and row–) cyclic Jacobi method for diagonalization of Hermitian matrices and for computation of the singular value decomposition of general matrices. It is shown that a block rotation (generalization of the Jacobi’s 2× 2 rotation) must be computed and implemented in a particular way to guarantee global convergence. This solves a long st...

متن کامل

A Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations

This paper introduces a globally convergent block (column– and row–) cyclic Jacobi method for diagonalization of Hermitian matrices and for computation of the singular value decomposition of general matrices. It is shown that a block rotation (generalization of the Jacobi’s 2× 2 rotation) must be computed and implemented in a particular way to guarantee global convergence. This solves a long st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007